Identifying codes for infinite triangular grids with a finite number of rows

نویسندگان

Rennan Dantas

Frédéric Havet

Rudini Menezes Sampaio

چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Dynamic Identifying Codes

A walk c1, c2, . . . , cM in an undirected graph G = (V, E) is called a dynamic identifying code, if all the sets I(v) = {u ∈ C : d(u, v) ≤ 1} for v ∈ V are nonempty and no two of them are the same set. Here d(u, v) denotes the number of edges on any shortest path from u to v, and C = {c1, c2, . . . , cM}. We consider dynamic identifying codes in square grids, triangular grids, hexagonal meshes...

متن کامل

Lower Bounds for Identifying Codes in some Infinite Grids

An r-identifying code on a graph G is a set C ⊂ V (G) such that for every vertex in V (G), the intersection of the radius-r closed neighborhood with C is nonempty and unique. On a finite graph, the density of a code is |C|/|V (G)|, which naturally extends to a definition of density in certain infinite graphs which are locally finite. We present new lower bounds for densities of codes for some s...

متن کامل

Optimization of infinite composite plates with quasi-triangular holes under in-plane loading

This study used particle swarm optimization (PSO) to determine the optimal values of effective design variables acting on the stress distribution around a quasi-triangular hole in an infinite orthotropic plate. These parameters were load angle, hole orientation, bluntness, fiber angle, and material properties, which were ascertained on the basis of an analytical method used by Lekhnitskii [3]. ...

متن کامل

Automated Discharging Arguments for Density Problems in Grids

Discharging arguments demonstrate a connection between local structure and global averages. This makes it an effective tool for proving lower bounds on the density of special sets in infinite grids. However, the minimum density of an identifying code in the hexagonal grid remains open, with an upper bound of 37 ≈ 0.428571 and a lower bound of 5 12 ≈ 0.416666. We present a new, experimental fram...

متن کامل